computational complexity theory - PDFSEARCH.IO - Document Search Engine

computational complexity theory
Results: 2049

#	Item
741	Guaranteed Scheduling for Switches with Configuration Overhead Brian Towles and William J. Dally Abstract— In this paper we present three algorithms that provide performance guarantees for scheduling switches, such as Add to Reading List Source URL: cva.stanford.edu Language: English - Date: 2005-12-01 13:38:04 Switches Analysis of algorithms Scheduling algorithms Computational complexity theory Scheduling Speedup Time complexity Graph coloring Crossbar switch Theoretical computer science Applied mathematics Mathematics
742	BELIZE International Year of the ChildC + L ABEL Add to Reading List Source URL: www.stampalbums.com Language: English - Date: 2014-06-28 09:37:15 Mathematics FO Overprint SO HO Finite model theory Descriptive complexity Computational complexity theory
743	Simpler Exact Leader Election via Quantum Reduction Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 2014-12-17 22:27:49 Computational complexity theory Quantum algorithm Quantum computer Randomized algorithm Algorithm Connectivity Distributed computing Low Aanderaa–Karp–Rosenberg conjecture Theoretical computer science Applied mathematics Mathematics
744	Quantum Adversary (Upper) Bound Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 2013-04-06 19:44:11 Models of computation Decision tree model Quantum algorithm Quantum computer PP Theoretical computer science Applied mathematics Computational complexity theory
745	A Parameterized Complexity Analysis of Combinatorial Feature Selection Problems? Vincent Froese, Ren´e van Bevern, Rolf Niedermeier, and Manuel Sorge Institut f¨ ur Softwaretechnik und Theoretische Informatik, TU Berli Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2013-06-19 10:42:56 Complexity classes Mathematical optimization Structural complexity theory NP-complete problems Parameterized complexity NP-complete P versus NP problem NP FO Theoretical computer science Computational complexity theory Applied mathematics
746	Prices Matter for the Parameterized Complexity of Shift Bribery Robert Bredereck1 , Jiehua Chen1 , Piotr Faliszewski2 , Andr´e Nichterlein1 , and Rolf Niedermeier1 1 TU Berlin, Berlin, Germany {robert.bredereck, jiehua. Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2014-05-07 05:57:23 Analysis of algorithms Social choice theory Single winner electoral systems Parameterized complexity Borda count Voting system Time complexity FO Reduction Theoretical computer science Computational complexity theory Applied mathematics
747	Improved Soundness for QMA with Multiple Provers Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 2013-01-14 01:47:53 Quantum complexity theory QMA Probabilistic complexity theory Proof theory Model theory IP Probabilistically checkable proof Cook–Levin theorem Time complexity Theoretical computer science Computational complexity theory Applied mathematics
748	On Directional vs. General Randomized Decision Tree Complexity for Read-Once Formulas Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 2011-06-16 14:46:43 Megafloods Quasiregular map Diluvium Computational complexity theory Decision tree model Geomorphology
749	Narratives and transdisciplines for a post-industrial world. T. F. H. Allen (University of Wisconsin, Madison, USA) and Mario Giampietro (INRAN, Italy) Add to Reading List Source URL: isss.org Language: English - Date: 2005-09-13 14:34:58 Structure Nature Cybernetics Abstraction Complexity Complex system Complex adaptive system Computational complexity theory Narrative Systems Science Complex systems theory
750	A multiprover interactive proof system for the local Hamiltonian problem Joseph Fitzsimons∗ Thomas Vidick† Abstract Add to Reading List Source URL: www.quantum-lab.org Language: English - Date: 2014-11-28 23:31:17 Quantum information science Complexity classes Interactive proof system QMA NEXPTIME IP Probabilistically checkable proof Qubit Quantum computer Theoretical computer science Applied mathematics Computational complexity theory

UPDATE